Parallel Merge Sort on Concurrent-Read Owner-Write PRAM
نویسندگان
چکیده
This paper discusses a variant of the CREW PRAM model introduced by Dymond and Ruzzo called CROW (Concurrent Read Owner Write) PRAM. in which each global memory location may only be written by its assigned owner processor. We show that CROW PRAMs can sort in O(log n) parallel time using O(n log n) processors.
منابع مشابه
On Optimal Orow-Pram Algorithms for Computing Recursively Defined Functions
Received (received date) Revised (revised date) Communicated by (Editor Name) ABSTRACT We investigate parallel algorithms to compute recursively deened functions. Our computational model are parallel random access machines (PRAM's). We preferably make use of the OROW-PRAM (owner read, owner write), a model supposed to be even weaker and more realistic than the EREW-PRAM (exclusive read, exclusi...
متن کاملParallel Processing Letters on Optimal Orow-pram Algorithms for Computing Recursively Defined Functions
Received (received date) Revised (revised date) Communicated by (Editor Name) ABSTRACT We investigate parallel algorithms to compute recursively deened functions. Our computational model are parallel random access machines (PRAM's). We preferably make use of the OROW-PRAM (owner read, owner write), a model supposed to be even weaker and more realistic than the EREW-PRAM (exclusive read, exclusi...
متن کاملEfficient and highly parallel computation
There are many variations of the basic parallel random access machine (PRAM), which includes an arbitrary number of processors sharing an arbitrary amount of random access memory. An exclusive-read, exclusive-write PRAM (EREW PRAM) does not allow any concurrent memory accesses (so all concurrent memory accesses must be explicitly serialized in the program). An EREW PRAM is useful because any al...
متن کاملEvaluating Parallel Algorithms Theoretical and Practical Aspects
The motivation for the work reported in this thesis has been to lessen the gap between theory and practice within the eld of parallel computing When looking for new and faster parallel algorithms for use in massively parallel systems it is tempting to investigate promising alternatives from the large body of research done on parallel algorithms within the eld of theoretical computer science The...
متن کاملParallel Merge Sort for Distributed Memory Architectures Parallel Merge Sort for Distributed Memory Architectures Ii Contents 1 Introduction 1 2 Cole's Parallel Merge Sort: the Crew Algorithm 1 3 Implementing the Crew Algorithm on a Distributed Memory Ar- Chitecture 7
Cole presented a parallel merge sort for the PRAM model that performs in O log n parallel steps using n processors He gave an algorithm for the CREW PRAM model for which the constant in the running time is small He also gave a more complex version of the algorithm for the EREWPRAM the constant factor in the running time is still moderate but not as small In this paper we give an approach to imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997